Threshold Dependent Data Embedding and Extracting Scheme Based on Pixel Pair Expansion Method

نویسندگان

  • Mandeep Singh
  • Neetu Sharma
چکیده

Digital watermark is a type of technology that embeds copyright information into digital image. Digital Watermarking works by hiding information inside digital data, such that it cannot be noticed without any software help with the purpose of building sure the covered data is present in all copies of the information that are completed whether legally or if not, in spite of efforts to scratch or eradicate it. Generally it is known that each watermark system consists of an embedding algorithm and an extracting algorithm. The embedding algorithm includes the watermark details in the data and the extracting algorithm decodes the watermark details. We have proposed a reversible embedding and extraction mechanism to embed data in an image which modify the embedded location in least significant bits. The algorithm has good embedding capacity along with preserving the original content of the image up to an acceptance level. This has been measured in terms of PSNR and MSE values which tell the degradation in watermarked image with respect to original image. The algorithm works in fully reversible domain in which there is no need of secret key as well as the original image as it uses only the watermarked image to extract the embedded bits in same sequence.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Steganography Scheme Based on Reed-Muller Code with Improving Payload and Ability to Retrieval of Destroyed Data for Digital Images

In this paper, a new steganography scheme with high embedding payload and good visual quality is presented. Before embedding process, secret information is encoded as block using Reed-Muller error correction code. After data encoding and embedding into the low-order bits of host image, modulus function is used to increase visual quality of stego image. Since the proposed method is able to embed...

متن کامل

Issn 2348-375x an Efficient Reversible Data Hiding Scheme Based on Two Dimensional Difference Histogram Modification of Pixel Differences

In this paper, based on two-dimensional difference histogram modification, a novel reversible data hiding (RDH)scheme is proposed by using binary space partition technique. The existing method data hiding is done by using difference pair-mapping and the data hiding aims to embed secret message into cover image. It is a natural extension of expansion embedding and shifting techniques used in cur...

متن کامل

Reversible Data Hiding Based on Invariant Image Classification and Expansion Embedding in Medical Images

In this paper, an improved reversible data hiding scheme is proposed . In the method proposed by us , it apply expansion embedding , which will adaptively takes care of local specifities of image content. In our method , it classify pixels based on their predicted value and pixels prediction errors. By applying expansion embedding to the pixels prediction errors and by considering their immedia...

متن کامل

A Prediction-Based Reversible Watermarking for MRI Images

Reversible watermarking is a special branch of image watermarking, that is able to recover the original image after extracting the watermark from the image. In this paper, an adaptive prediction-based reversible watermarking scheme is presented, in order to increase the payload capacity of MRI medical images. The scheme divides the image into two parts, Region of Interest (ROI) and Region of No...

متن کامل

Maximal Independent Sets for the Pixel Expansion of Graph Access Structure

 Abstract : A visual cryptography scheme based on a given graph G is a method to distribute a secret image among the vertices of G, the participants, so that a subset of participants can recover the secret image if they contain an edge of G, by stacking their shares, otherwise they can obtain no information regarding the secret image. In this paper a maximal independent sets of the graph G was ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014